Finitely convergent ε-generalized projection algorithm for nonlinear systems
نویسندگان
چکیده
منابع مشابه
A Generalized Projection method for systems of nonlinear equations
A Generalized Projection method for systems of nonlinear equations " (1971). Retrospective Theses and Dissertations. Paper 4896. 1971 Signature was redacted for privacy. In this work a Projection method for solving systems of linear equations is extended to cover the nonlinear case. Projection methods fall into the broad class of minimization methods, which includes the various types of gradien...
متن کاملFinitely Convergent Decomposition Algorithms For
We study a class of two-stage stochastic integer programs with general integer vari4 ables in both stages and finitely many realizations of the uncertain parameters. Based on Benders’ 5 method, we propose a decomposition algorithm that utilizes Gomory cuts in both stages. The Go6 mory cuts for the second-stage scenario subproblems are parameterized by the first-stage decision 7 variables, i.e.,...
متن کاملAn Algorithm for Multi-Realization of Nonlinear MIMO Systems
This paper presents a theoretical approach to implementation of the “Multi-realization of nonlinear MIMO systems”. This method aims to find state-variable realization for a set of systems, sharing as many parameters as possible. In this paper a special nonlinear multi-realization problem, namely the multi-realization of feedback linearizable nonlinear systems is considered and an algorithm for ...
متن کاملExistence Results for Generalized ε-Vector Equilibrium Problems
This paper studies some existence results for generalized epsilon-vector equilibrium problems and generalized epsilon-vector variational inequalities. The existence results for solutions are derived by using the celebrated KKM theorem. The results achieved in this paper generalize and improve the works of many authors in references.
متن کاملSliding Window Generalized Kernel Affine Projection Algorithm Using Projection Mappings
Very recently, a solution to the kernel-based online classification problem has been given by the adaptive projected subgradient method (APSM). The developed algorithm can be considered as a generalization of a kernel affine projection algorithm (APA) and the kernel normalized least mean squares (NLMS). Furthermore, sparsification of the resulting kernel series expansion was achieved by imposin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2007
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2006.11.020